The bi-objective stochastic covering tour problem
نویسندگان
چکیده
منابع مشابه
The bi-objective covering tour problem
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the covering tour problem, which means that the covering distance and the associated constraints have been replaced by a new objective. We propose a two-phase cooperative strategy that combines a multi-objective evolutionar...
متن کاملTwo new heuristic algorithms for Covering Tour Problem
Covering Tour Problem (CTP) is the generalized form of Traveling Salesman Problem (TSP), which has found different applications in the designing of distribution networks, disaster relief, and transportation routing. The purpose of this problem is to determine the Hamiltoniancyclewiththe lowest costusinga subset of all the nodes, such that the other nodes would be in a distance shorter than the ...
متن کاملMathematical Model for Bi-objective Maximal Hub Covering Problem with Periodic Variations of Parameters
The problem of maximal hub covering as a challenging problem in operation research. Transportation programming seeks to find an optimal location of a set of hubs to reach maximum flow in a network. Since the main structure's parameters of the problem such as origin-destination flows, costs and travel time, change periodically in the real world applications, new issues arise in handling it. In t...
متن کاملThe Stochastic Eulerian Tour Problem
This paper defines the Stochastic Eulerian Tour Problem (SETP) and investigates several characteristics of this problem. Given an undirected Eulerian graph , a subset =) of the edges in E that require service, and a probability distribution for the number of edges in R that have to be visited in any given instance of the graph, the SETP seeks an a priori Eulerian tour of minimum expected length...
متن کاملThe Disk Covering Tour Problem in the Wireless Sensor Network
The paper discusses the disk covering tour problem for reducing the mobile devices’ mobile electricity costs consumed in the wireless sensor network. The DCTP discusses how to find a tour whose cost is the minimum under the condition of the defined initial points and some planar points. The tour starts from the initial stop point. After passing many stop points, the tour returns to the initial ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2012
ISSN: 0305-0548
DOI: 10.1016/j.cor.2011.09.009